Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks
نویسندگان
چکیده
منابع مشابه
DISCRETE TOMOGRAPHY AND FUZZY INTEGER PROGRAMMING
We study the problem of reconstructing binary images from four projections data in a fuzzy environment. Given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. We provide an iterative algorithm based on fuzzy integer programming and linear membership functions.
متن کاملTechnical Report Integer Programming 1 Integer Programming 4
1 To appear as a chapter of the Handbook of Algorithms edited by M. Abstract Integer programming is an expressive framework for modeling and solving discrete optimization problems that arise in a variety of contexts in the engineering sciences. Integer programming representations work with implicit algebraic constraints (linear equations and inequalities on integer valued variables) to capture ...
متن کاملdiscrete tomography and fuzzy integer programming
we study the problem of reconstructing binary images from four projections data in a fuzzy environment. given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. we provide an iterative algorithm based on fuzzy integer programming and linear membership functions.
متن کاملAn algorithm for the multiparametric 0-1-integer linear programming problem relative to the constraint matrix
The multiparametric 0–1-Integer Linear Programming (0–1-ILP) problem relative to the constraint matrix is a family of 0–1-ILP problems in which the problems are related by having identical objective and right-hand-side vectors. In this paper we present an algorithm to perform a complete multiparametric analysis. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملAND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the structure of the model, which can translate into exponential time savings for search algorithms. In this paper we extend the recently introduced AND/OR Branch-and-Bound algorithm (AOBB) [1] for solving p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1980
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.28.3.829